Cycle decomposition (graph theory)

For the notation used to express permutations, see Cycle decomposition (group theory).

In graph theory, a cycle decomposition is a partitioning of the vertices of a graph into subsets, such that the vertices in each subset lie on a cycle.

Definition

References

Bondy, J.A.; Murty, U.S.R. (2008), "2.4 Decompositions and coverings", Graph Theory, Springer, ISBN 978-1-84628-969-9 .